منابع مشابه
K-sorted Permutations with Weakly Restricted Displacements
A permutation ) ( 2 1 n π π π π = of {1, 2,..., n} is called k-sorted if and only if , k i i ≤ −π for all . 1 n i ≤ ≤ We propose an algorithm for generating the set of all k-sorted permutations of {1, 2,..., n} in lexicographic order. An inversion occurs between a pair of ( i π , j π ) if i < j but i π > j π . Let I(n, k) denote the maximum number of inversions in k-sorted permutations. For k...
متن کاملPermutations with Inversions
The number of inversions in a random permutation is a way to measure the extent to which the permutation is “out of order”. Let In(k) denote the number of permutations of length n with k inversions. This paper gives asymptotic formulae for the sequences {In+k(n), n = 1, 2, . . .} for fixed k.
متن کاملSorted and or sortable permutations
In his Ph D thesis Julian West studied in depth a map that acts on permutations of the symmetric group Sn by partially sorting them through a stack The main motivation of this paper is to characterize and count the permutations of Sn which we call sorted permutations This is equivalent to counting preorders of increasing binary trees We rst nd a local characterization of sorted permutations The...
متن کاملVariations on Descents and Inversions in Permutations
We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation σ = σ1σ2 · · · σn defined as the set of indices i such that either i is odd and σi > σi+1, or i is even and σi < σi+1. We show that this statistic is equidistributed with the odd 3-factor set statistic on permutations σ̃ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00099-7